Nearest-neighbour transition-state analysis for nucleic acid kinetics
نویسندگان
چکیده
منابع مشابه
Title Nearest Neighbour Contingency Table Analysis
March 19, 2012 Type Package Title Nearest Neighbour Contingency Table Analysis Version 0.0-3 Date 2012-03-19 Author Marcelino de la Cruz Rot and Philip M. Dixon Maintainer Marcelino de la Cruz Rot Depends splancs, spatstat Description Function to test spatial segregation and association based in contingency table analysis of nearest neighbour counts following Dixon (...
متن کاملNearest-neighbour classifiers in natural scene analysis
It is now well-established that k nearest-neighbour classi"ers o!er a quick and reliable method of data classi"cation. In this paper we extend the basic de"nition of the standard k nearest-neighbour algorithm to include the ability to resolve con#icts when the highest number of nearest neighbours are found for more than one training class (model-1). We also propose model-2 of nearest-neighbour ...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملEnhanced Nearest Neighbour
Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have be...
متن کاملNearest Neighbour Search for Visualization Using Arbitrary Triangulations Nearest Neighbour Search for Visualization Using Arbitrary Triangulations
In visualization of scattered data, one is often faced with the problem of nding the nearest neighbours of a data site. This task frequently occurs in an advanced stage of the visualization process, where several data structures have been created during run time. Many applications compute a triangulation of the data for their visualization purposes. To take advantage of this previously allocate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nucleic Acids Research
سال: 2021
ISSN: 0305-1048,1362-4962
DOI: 10.1093/nar/gkab205